Conjugate gradient algorithms andthe Galerkin boundary element method

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiplicative Schwarz Algorithms for the Galerkin Boundary Element Method

We study the multiplicative Schwarz method for the p-version Galerkin boundary element method for a hypersingular and a weakly singular integral equation of the rst kind and for the h-version for a hypersingular integral equation of the rst kind. We prove that the rate of convergence of the multiplicative Schwarz operator is strictly less than 1 for the h-version for both two level and multilev...

متن کامل

A parallel version of the preconditioned conjugate gradient method for boundary element equations

The parallel version of precondition techniques is developed for matrices arising from the Galerkin boundary element method for two-dimensional domains with Dirichlet boundary conditions. Results were obtained for implementations on a transputer network as well as on an nCUBE-2 parallel computer showing that iterative solution methods are very well suited for a MIMD computer. A comparison of nu...

متن کامل

Preconditioned Conjugate Gradient Method for Boundary Artifact-Free Image Deblurring

Several methods have been proposed to reduce boundary artifacts in image deblurring. Some of those methods impose certain assumptions on image pixels outside the field-of-view; the most important of these assume reflective or anti-reflective boundary conditions. Boundary condition methods, including reflective and anti-reflective ones, however, often fail to reduce boundary artifacts, and, in s...

متن کامل

Implementation of Conjugate Gradient Algorithms

We evaluate the High-Performance Fortran (HPF) language for the compact expression and eecient implementation of conjugate gradient iterative matrix-solvers on High Performance Computing and Communi-cations(HPCC) platforms. We discuss the use of intrinsic functions, data distribution directives and explicitly parallel constructs to optimize performance by minimizing communications requirements ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 2004

ISSN: 0898-1221

DOI: 10.1016/j.camwa.2004.02.002